Parameterized Complexity Analysis in Robot Motion Planning
نویسندگان
چکیده
Given a robot in an environment composed of some set of obstacles and initial and nal positions of the robot within this environment, the motion planning problem involves nding a sequence of motions that move the robot from the initial to the nal position without intersecting any of the obstacles. Though polynomial-time algorithms are known for this problem for very limited kinds of robots, e.g., line segments, disks, rectangles (see [21] and references), the best known algorithm for arbitrarily com-
منابع مشابه
Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration
This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...
متن کاملStable Gait Planning and Robustness Analysis of a Biped Robot with One Degree of Underactuation
In this paper, stability analysis of walking gaits and robustness analysis are developed for a five-link and four-actuator biped robot. Stability conditions are derived by studying unactuated dynamics and using the Poincaré map associated with periodic walking gaits. A stable gait is designed by an optimization process satisfying physical constraints and stability conditions. Also, considering...
متن کاملPlanning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کاملParameterized Complexity Analysis in Robot Motion Planning - Systems, Man and Cybernetics, 1995. 'Intelligent Systems for the 21st Century'., IEEE Internationa
Given a robot in an environment composed of some set of obstacles and initial and final positions of the robot within this environment, the m o t i o n p lanning problem involves finding a sequence of motions that move the robot from the initial to the final position without intersecting any of the obstacles. Though polynomial-time algorithms are known for this problem for very limited kinds of...
متن کاملRepresentation of robot motion control skill
Development of skilled robotics draws clues from model-based theories of human motor control. Thus, a comprehensive anthropomorphic background is given in the introductory part of the paper. Skills in robotics are viewed as a tool for fast and efficient real-time control that can handle complexity and nonlinearity of robots, generally aiming at robot autonomy. Particularly, a skill of redundanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995